Hill Climbers and Mutational Heuristics in Hyperheuristics
نویسندگان
چکیده
Hyperheuristics are single candidate solution based and simple to maintain mechanisms used in optimization. At each iteration, as a higher level of abstraction, a hyperheuristic chooses and applies one of the heuristics to a candidate solution. In this study, the performance contribution of hill climbing operators along with the mutational heuristics are analyzed in depth in four different hyperheuristic frameworks. Four different hill climbing operators and three mutational operators are used during the experiments. Various subsets of the heuristics are evaluated on fourteen well-known benchmark functions.
منابع مشابه
Memetic Algorithms and Hyperhill-climbers
Memetic algorithms (MAs) are meta-heuristics that join genetic algorithms with hill climbing. MAs have recognized success in solving difficult search and optimization problems. Hyperheuristics are proposed as an alternative to meta-heuristics. A hyperheuristic is a mechanism that chooses a heuristic from a set of heuristics, applies it to a candidate solution, and then makes a decision for acce...
متن کاملA self-organising hyper-heuristic framework
Hyper-heuristics can be thought of as heuristic management methodologies which are motivated by the goal of building a high level of generality in the scope of computational search methodologies [2] [7]. Most meta-heuristics (and other search methods) perform a search over the solution space directly, whereas, hyper-heuristics as high level strategies search a heuristic space. One of the hyper-...
متن کاملCollaboration Between Hyperheuristics to Solve Strip-Packing Problems
In this paper we introduce a collaboration framework for hyperheuristics to solve hard strip packing problems. We have designed a genetic based hyperheuristic to cooperate with a hill-climbing based hyperheuristic. Both of them use the most recently proposed low-level heuristics in the literature. REVAC, which has recently been proposed for tuning [18], has been used to find the best operators ...
متن کاملDevelopment and Application of Hyperheuristics to Personnel Scheduling
This thesis is concerned with the investigation of hyperheuristic techniques. Hyperheuristics are heuristics which choose heuristics in order to solve a given optimisation problem. In this thesis we investigate and develop a number of hyperheuristic techniques including a hyperheuristic which uses a choice function in order to select which low-level heuristic to apply at each decision point. We...
متن کاملChoice Function and Random Hyperheuristics
A hyperheuristic is a high-level heuristic which adaptively controls the combination of several low-level knowledgepoor heuristics so that while using only cheap and easyto-implement low-level heuristics, we may achieve solution quality approaching that of an expensive knowledgerich approach. Hyperheuristics have been successfully applied by the authors to three real-world problems of personnel...
متن کامل